CS 611 Lecture 32 Isorecursive Types 14 th November , 2001
نویسندگان
چکیده
In other words, foo is an alias for the type int. On the other hand, two types can be equivalent based on their structure. For example, in ML we have: {x: int, y: int}∼= {y: int, x: int} This equation tells us the order in the record structure is unimportant, which makes sense since we get the element of a record by a term like e.x, which has nothing to do with the order of the fields. For implementation reasons, similar types in many languages(e.g. C) are not considered equivalent.
منابع مشابه
CS 611 Lecture 34 Curry - Howard Isomorphism November 15 , 2000
The Curry-Howard isomorphism is a correspondence between logical formulas and types. The central idea is that each type τ corresponds to a logical formula φ, and that a proof that some expression e is well-formed with respect to type τ , (i.e., e : τ) corresponds to a proof that the logical formula φ is logically valid. Many variations of classical logic have been developed, especially in the l...
متن کامل00 1 Fractional Charge
The origin and quantum status of Fractional Charge in polyacetylne and field theory are reviewed, along with reminiscences of collaboration with John Bell on the subject. [ Invited Lecture at the International Conference ”Quantum (Un)speakables” in honour of John Bell, held at Vienna, November 10-14 , 2000. ]
متن کاملCS 611 Lecture 11 Fixed Points and CPOs 9 - 18 - 00
But which fixed point of Γ do we want? We would like to take the “least” fixed point, in the sense that we want C[[while b do c]] to give a non-⊥ result only when required by the intended semantics. (For example, we want C[[while true do skip]]σ =⊥ for all σ.) The rest of this lecture will expand on this notion of least fixed point, with a look at the underlying theory of partial orders. Iterat...
متن کامل